#include <bits/stdc++.h>
using namespace std;
int n,a[100005],bucket[100005],ans;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i = 1;i <= n;i++) scanf("%d",&a[i]);
    for(int i = 1;i <= n;i++) bucket[a[i]]++;
    for(int i = 0;i <= 100000;i++) ans = max(ans,bucket[i]);
    printf("%d",ans);
    return 0;
}
